منابع مشابه
Complexity and synchronization.
We study a fully connected network (cluster) of interacting two-state units as a model of cooperative decision making. Each unit in isolation generates a Poisson process with rate g . We show that when the number of nodes is finite, the decision-making process becomes intermittent. The decision-time distribution density is characterized by inverse power-law behavior with index mu=1.5 and is exp...
متن کاملSubword Complexity and k-Synchronization
We show that the subword complexity function ρx(n), which counts the number of distinct factors of length n of a sequence x, is k-synchronized in the sense of Carpi if x is k-automatic. As an application, we generalize recent results of Goldstein. We give analogous results for the number of distinct factors of length n that are primitive words or powers. In contrast, we show that the function t...
متن کاملSynchronization Complexity Metric
As multitasking environments and applications become more and more common, the quality and efficiency of these applications becomes more and more important. While for single-threaded programs there are many complexity metrics in use since the 1970’s, so far there was no way to efficiently measure and compare the complexity of multitasking programs, and the affect of the concurrency on the overa...
متن کاملAnti-synchronization and synchronization of T-system
In this paper, we discuss the synchronization and anti-synchronization of two identical chaotic T-systems. The adaptive and nonlinear control schemes are used for the synchronization and anti-synchronization. The stability of these schemes is derived by Lyapunov Stability Theorem. Firstly, the synchronization and anti-synchronization are applied to systems with known parameters, then to systems...
متن کاملParameterized Complexity of Synchronization and Road Coloring
A word is called a reset word for a deterministic finite automaton if it maps all states of the automaton to a unique state. Deciding about the existence of a reset word of a given length for a given automaton is known to be a NP-complete problem. We use tools provided by Bodlaender et al. (2007) to prove that such problem, parameterized by number of states, does not admit a polynomial kernel u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2009
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.80.021110